Hyper-archimedean vector lattices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

Egoroff, Σ, and Convergence Properties in Some Archimedean Vector Lattices

An archimedean vector lattice A might have the following properties: (1) the sigma property (σ): For each {an}n∈N ⊆ A there are {λn}n∈N ⊆ (0,∞) and a ∈ A with λnan ≤ a for each n; (2) order convergence and relative uniform convergence are equivalent, denoted (OC⇒ RUC): if an ↓ 0 then an → 0 r.u. The conjunction of these two is called strongly Egoroff. We consider vector lattices of the formD(X)...

متن کامل

Inclusions and non-inclusions of Archimedean and Laves lattices

For each pair of graphs from among the Archimedean lattices and their dual Laves lattices we demonstrate that one is a subgraph of the other or prove that neither can be a subgraph of the other. Therefore, we determine the entire partial ordering by inclusion of these 19 infinite periodic graphs. There are a total of 72 inclusion relationships, of which 35 are covering relations in the partial ...

متن کامل

Site percolation thresholds and universal formulas for the Archimedean lattices

The site percolation thresholds pc are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results pc = 0.697 043, honeycomb or (6 ), 0.807 904 (3, 12), 0.747 806 (4, 6, 12), 0.729 724 (4, 8), 0.579 498 (3, 6), 0.621 819 (3, 4, 6, 4), 0.550 213 (3, 4), and 0.550 806 (3, 4, 3, 4), and errors of about ±2 × 10. (The rema...

متن کامل

Bond percolation critical probability bounds for three Archimedean lattices

Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 12 ) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 8 ) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 12) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 12) bond percolation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae (Proceedings)

سال: 1974

ISSN: 1385-7258

DOI: 10.1016/1385-7258(74)90011-0